package com.codeforces.contest.c305;

import java.util.Arrays;
import java.util.Scanner;

public class _305A {

	static Scanner scanner = new Scanner(System.in);
	static int k;
	static int na, nb, n, co;
	static int[] nn;
	static int[] num = new int[200];

	public static void main(String[] args) {
		k = scanner.nextInt();
		nn = new int[k];
		for (int i=0;i<k;++i) {
			nn[i] = scanner.nextInt();
		}
		Arrays.sort(nn);
		co = 0;
		for (int i=0;i<k;++i) {
			n = nn[i];
			if (n == 0 || n == 100) {
				num[co] = n;
				co++;
			}
			else if (n < 10) {
				if (na != 1) {
					num[co] = n;
					co++;
					na = 1;
				}
			}
			else {
				if (na == 1) {
					if (n % 10 == 0) {
						if (nb != 1) {
							num[co] = n;
							co++;
							nb = 1;
						}
					}
				}
				else {
					if (nb != 1) {
						num[co] = n;
						co++;
						nb = 1;
					}
				}
			}
		}
		System.out.println(co);
		for (int i=0;i<co;i++) {
			System.out.print(num[i]);
			if (i == co - 1) {
				System.out.println();
			}
			else {
				System.out.print(" ");
			}
		}

	}

}
